The Cohesiveness of Blocks in Social Networks: Connectivity and Conditional Density
نویسندگان
چکیده
The social cohesion of a group, as measured by patterns of network ties, increases with the level of redundancy of interconnections of its members. We will see that the minimal number k of independent paths that connect every pair of actors in a group, the higher the cohesion. The cohesiveness of a group is also measured by the extent to which it is not disconnected by removal of 1, 2, 3,..., n actors. Menger’s Theorem proves that these two measures are equivalent. Within this conceptual framework, we evaluate the family of concepts of cohesion and establish the validity of a pair of related measures: Connectivity – the minimum number k of its actors whose removal would not allow the group to remain connected or would reduce the group to but a single member – measures the social cohesion of a group at a general level; Conditional Density measures cohesion on a finer scale, that of surplus density beyond that implied by connectivity. For each k, these two measures may be combined into an aggregate measure of social cohesion, suitable for both smalland large-scale network studies. Using these measures within a new methodology of cohesive blocking we test hypotheses about the consequences of cohesion for social groups and their members, and demonstrate with empirical examples the significance and theoretical relevance of network cohesion as measured by connectivity in a variety of substantively important applications in sociology.
منابع مشابه
Evaluation of Model-Based Methods in Estimating Dynamic Functional Connectivity of Brain Regions
Today, neuroscientists are interested in discovering human brain functions through brain networks. In this regard, the evaluation of dynamic changes in functional connectivity of the brain regions by using functional magnetic resonance imaging data has attracted their attention. In this paper, we focus on two model-based approaches, called the exponential weighted moving average model and the d...
متن کاملNODE CONNECTIVITY AND CONDITIONAL DENSITY– D. White and F. Harary Definitions of Cohesive Sets in Social Networks
متن کامل
ENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...
متن کاملA new conforming mesh generator for three-dimensional discrete fracture networks
Nowadays, numerical modelings play a key role in analyzing hydraulic problems in fractured rock media. The discrete fracture network model is one of the most used numerical models to simulate the geometrical structure of a rock-mass. In such media, discontinuities are considered as discrete paths for fluid flow through the rock-mass while its matrix is assumed impermeable. There are two main pa...
متن کاملRepresenting a Model for Improving Connectivity and Power Dissipation in Wireless Networks Using Mobile Sensors
Wireless sensor networks are often located in areas where access to them is difficult or dangerous. Today, in wireless sensor networks, cluster-based routing protocols by dividing sensor nodes into distinct clusters and selecting local head-clusters to combine and send information of each cluster to the base station and balanced energy consumption by network nodes, get the best performance ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000